Pathfinding Architecture Optimizations
نویسندگان
چکیده
منابع مشابه
Crafting Data Structures: A Study of Reference Locality in Refinement-Based Pathfinding
The widening gap between processor speed and memory latency increases the importance of crafting data structures and algorithms to exploit temporal and spatial locality. Refinement-based pathfinding algorithms, such as Classic Refinement, find near-optimal paths in very large sparse graphs where traditional search techniques fail to generate paths in acceptable time. In this paper we present a ...
متن کاملPath-finding for Large Scale Multiplayer Computer Games
Path-finding consumes a significant amount of resources, especially in movement-intensive games such as (massively) multiplayer games. We investigate several pathfinding techniques, and explore the impact on performance of workloads derived from real player movements in a multiplayer game. We find that a map-conforming, hierarchical path-finding strategy performs best, and in combination with c...
متن کاملPathfinding Based on Pattern Detection Using Genetic Algorithms
This paper presents a novel method to optimize the process of finding paths using a model based on Genetic Algorithms and Best-First-Search for real time systems, such as video games and virtual reality environments. The proposed solution uses obstacle pattern detection based at online training system to guarantee the memory economy. The architecture named Patterned based Pathfinding with Genet...
متن کاملOptimizing Motion-Constrained Pathfinding
High-quality motion planning can be quite expensive to perform, yet is critical for many video games. As a result, many approximations are employed to reduce costs. Common approximations include pathfinding on a grid or on a navigation mesh instead of in a real-valued world. As a result, the paths that are found are not immediately appropriate for use, and often require post-processing, such as...
متن کاملMulti-core scalable and efficient pathfinding with Parallel Ripple Search
Game developers are often faced with very demanding requirements on huge numbers of agents moving naturally through increasingly large and detailed virtual worlds. With the advent of multi-core architectures, new approaches to accelerate expensive pathfinding operations are worth being investigated. Traditional single-processor pathfinding strategies, such as A and its derivatives, have been lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015